Map Decoding of Arithmetic Codes with a Forbidden Symbol
نویسندگان
چکیده
In this paper, a novel maximum a posteriori (MAP) technique for the decoding of arithmetic codes in the presence of transmission errors is presented. Arithmetic codes with a forbidden symbol and trellis search techniques are employed in order to estimate the best transmitted codeword. The viability of the proposed approach is demonstrated in the binary symmetric channel case in terms of both performance and decoding complexity. The results are compared with a traditional separated approach based on rate compatible convolutional codes. The MAP decoding is applied to the progressive transmission of SPIHT compressed images and competitive results in terms of average decoded quality are reported.
منابع مشابه
Error correction by means of arithmetic codes: an application to resilient image transmission
In this paper, two novel maximum a posteriori (MAP) estimators for the decoding of arithmetic codes in the presence of transmission errors are presented. Trellis search techniques and a forbidden symbol are employed to obtain forward error correction. The proposed system is applied to lossless image compression and transmission across the BSC; the results are compared in terms of both performan...
متن کاملError Correcting Arithmetic Coding for Robust Video Compression
In this paper we present a novel error correcting arithmetic co/decoder, based on forbidden symbol detection and maximum a posteriori estimation. The error correction goal is obtained by means of a sub-optimal metric-first search technique that exhibits attractive performance in terms of error recovery and decoding complexity. The proposed technique is able to compress the input data and at the...
متن کاملError Recovery Properties and Soft Decoding of Quasi-Arithmetic Codes
This paper first introduces a new set of aggregated state models for soft-input decoding of quasi arithmetic (QA) codes with a termination constraint. The decoding complexity with these models is linear with the sequence length. The aggregation parameter controls the tradeoff between decoding performance and complexity. It is shown that close-to-optimal decoding performance can be obtained with...
متن کاملChase-Like Decoding of Arithmetic Codes with Applications
Motivated by recent results in Joint Source/Channel (JSC) coding and decoding, this paper addresses the problem of soft input decoding of Arithmetic Codes (AC). A new length-constrained scheme for JSC decoding of these codes is proposed based on the Maximum a posteriori (MAP) sequence estimation criterion. The new decoder, called Chase-like arithmetic decoder is supposed to know the source symb...
متن کاملSymbol-by-Symbol MAP Decoding of Nonbinary Codes
Symbol-by-symbol maximum a posteriori (MAP) decoding algorithms for linear nonbinary block and convolutional codes over both extension elds GF(q = p a) and integer rings Z q are presented. Equivalent MAP decoding rules employing the dual code are given which are computationally more eecient for high-rate codes. The suitabil-ity of the proposed algorithms is demonstrated by applying them to a pa...
متن کامل